منابع مشابه
A Vectorial Inverse Nodal Problem
Consider the vectorial Sturm-Liouville problem: −y′′(x) + P (x)y(x) = λIdy(x) Ay(0) + Idy ′(0) = 0 By(1) + Idy ′(1) = 0 where P (x) = [pij(x)]i,j=1 is a continuous symmetric matrix-valued function defined on [0, 1], and A and B are d×d real symmetric matrices. An eigenfunction y(x) of the above problem is said to be of type (CZ) if any isolated zero of its component is a nodal point of y(x...
متن کاملInverse nodal problem for p-Laplacian with two potential functions
In this study, inverse nodal problem is solved for the p-Laplacian operator with two potential functions. We present some asymptotic formulas which have been proved in [17,18] for the eigenvalues, nodal points and nodal lengths, provided that a potential function is unknown. Then, using the nodal points we reconstruct the potential function and its derivatives. We also introduce a solution of i...
متن کاملInverse nodal problem and Ambarzumyan problem for the p-Laplacian
We study the issues of reconstruction and stability issues of the inverse nodal problem for the one-dimensional p-Laplacian eigenvalue problem. A key step is the application of a modified Prüfer substitution to derive a detailed asymptotic expansion for the eigenvalues and nodal lengths. Two associated Ambarzumyan problems are also solved. AMS Subject Classification (2000) : 34A55, 34B24. 1 2 1...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Inverse feasible problem
In many infeasible linear programs it is important to construct it to a feasible problem with a minimum pa-rameters changing corresponding to a given nonnegative vector. This paper defines a new inverse problem, called “inverse feasible problem”. For a given infeasible polyhedron and an n-vector a minimum perturba-tion on the parameters can be applied and then a feasible polyhedron is concluded.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Differential Equations
سال: 2001
ISSN: 0022-0396
DOI: 10.1006/jdeq.2000.3911